Simultaneous diagonalization of conics in $$PG(2,q)$$ P G ( 2 , q )
نویسندگان
چکیده
منابع مشابه
On Surfaces with P G = Q = 2 *
The present paper is devoted to the classification of irregular surfaces of general type with pg = q = 2 and non birational bicanonical map. The main result is that, if S is such a surface and if S is minimal with no pencil of curves of genus 2, then S is a double cover of a principally polarized abelian surface (A,Θ), with Θ irreducible. The double cover S → A is branched along a divisor B ∈ |...
متن کامل1 Scheme Independence of g p 1(x,Q 2)
We work with two general factorization schemes in order to explore the consequences of imposing scheme independence on g 1(x,Q 2). We see that although the light quark sector is indifferent to the choice of a particular scheme, the extension of the calculations to the heavy quark sector indicates that a scheme like the MS is preferable. The problem raised by the results of the EMC spin experime...
متن کاملN , p , q ) Harmonic Superspace G . G . Hartwell and P .
A family of harmonic superspaces associated with four-dimensional Minkowski spacetime is described. Applications are given to free mass-less supermultiplets, invariant integrals and super Yang-Mills. The generalisation to curved spacetimes is given with emphasis on confor-mal supergravities.
متن کاملA SURFACE OVER Q WITH p g = q = 1 , K 2 = 2 AND MINIMAL PICARD NUMBER
Following an idea of Ishida, we develop polynomial equations for certain unramified double covers of surfaces with pg = q = 1 and K 2 = 2. Our first main result is to show the existence of a surface X with these invariants defined over Q that has the smallest possible Picard number ρ(X) = 2. This is done by giving equations for the double cover X̃ of X, calculating the zeta function of the reduc...
متن کامل2 P vs . NP and Diagonalization
2.1 3SAT is NP–hard Definition 2.1 (the class NP). L ⊂ {0, 1}∗ is in the class of NP if there exists a polynomial p : N→ N and a Turing machine M (called the verifier for L) such that for every x ∈ {0, 1}∗, x ∈ L ⇔ ∃y ∈ {0, 1}p(|x|) such that M(x, y) = 1. If x ∈ L and y ∈ {0, 1}p(|x|) satisfy M(x, y) = 1, then we call y a certificate/witness for x (with respect to the language L and machine M)....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2015
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-015-0097-z